A Geometric Constraint Solver with Decomposable Constraint Set
نویسندگان
چکیده
$EVWUDFW ,Q WKH SDSHU D QHZ FRQVWUXFWLYH DSSURDFK WR VROYLQJ JHRPHWULF FRQVWUDLQWV LQ ' VSDFH LV SUHVHQWHG 7KH PDLQ VWHS RI WKH DOJRULWKP LV SUH SURFHVVLQJ ZKLFK WUDQVIRUPV ERWK JHRPHWULF HOHPHQWV DQG JHRPHWULF FRQVWUDLQWV LQWR VLPSOHU IRUPV DQG DGGV UHGXQGDQW FRQVWUDLQWV RI GLVWDQFHV DQG DQJOHV E\ VROYLQJ WULDQJOHV DQG GHWHUPLQLQJ VXPV DQG GLIIHUHQFHV RI DGMDFHQW DQJOHV $ ZLGH YDULHW\ RI ZHOO FRQVWUDLQHG SUREOHPV FDQ WKHQ EH VROYHG E\ D VLPSOH WHFKQLTXH RI ORFDO SURSDJDWLRQ DQG RYHU FRQVWUDLQHG VFHQHV DQG LQSXW GDWD FRQWUDGLFWRU\ WR VRPH ZHOO NQRZQ PDWKHPDWLFDO WKHRUHPV FDQ DOVR EH GHWHFWHG LQ WKH VDPH SKDVH 2QO\ ZLWK XQGHU FRQVWUDLQHG SUREOHPV DQG VRPH VSHFLDO ZHOO FRQVWUDLQHG FDVHV DQ DGGLWLRQDO VWHS RI PHUJLQJ FOXVWHUV DQG RU JHRPHWULFDO UHOD[DWLRQ LV UHTXLUHG
منابع مشابه
h-graphs: A new representation for tree decompositions of graphs
In geometric constraint solving, well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination planner based solver. In general decomposition and recombination steps can be completed only when other steps have already been completed. This fact naturally defines a hie...
متن کاملTree-decomposable and Underconstrained Geometric Constraint Problems
A geometric constraint problem, also known as a geometric constraint system, consists of a finite set of geometric objects, such as points, lines, circles, planes, spheres, etc., and constraints upon them, such as incidence, distance, tangency, and so on. A solution of a geometric constraint problem P is a coordinate assignment for each of the geometric objects of P that places them in relation...
متن کاملSimulation of Strap-On Boosters Separation in the Atmosphere
A numerical dynamic-aerodynamic interface for simulating the separation dynamics of constrained strap-on boosters jettisoned in the atmosphere is presented. A 6-DOF multi body dynamic solver ،using Constraint Force Equation Methodology is coupled with a numerical time dependent Euler flow solver. An automatic dynamic mesh updating procedure is employed using smoothing and l...
متن کاملTheory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation finite(t) which enables to distinguish between finite or infinite trees. We show that T has at least one model and prove its completeness by giving not only a decision procedure, but a full first-order const...
متن کاملA Two-body Solver for Assembly Modelling
Assembly modelling deals with the spatial joining of rigid bodies in 3D-space for which constraint based modelling is a proven approach. The existing geometric constraint solvers do not satisfy all needs, there are still challenges for research. The two-body-problem (constraint intersection) and the three-body-problem (constraint composition) are subproblems which have exploitable properties on...
متن کامل